data structure - definizione. Che cos'è data structure
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è data structure - definizione

PARTICULAR WAY OF STORING AND ORGANIZING DATA IN A COMPUTER
Data structures; Data Structures; Composite data structure; Structure (CS); Structure (computer science); Active data structure; Pattern Oriented Rule Implementation; Pattern oriented Rule Implementation; PORI; Data Structure; Datastructure; Data structure augmentation; Augmenting Data Structures; Linear and nonlinear data structure; Types of data structures; Types of Data Structures; Static and dynamic data structures; Construct (information technology)
  •  Python 3]].

data structure         
<data, programming> Any method of organising a collection of data to allow it to be manipulated effectively. It may include meta data to describe the properties of the structure. Examples data structures are: array, dictionary, graph, hash, heap, linked list, matrix, object, queue, ring, stack, tree, vector. (2003-09-11)
Implicit data structure         
DATA STRUCTURE THAT STORES VERY LITTLE INFORMATION OTHER THAN THE MAIN OR REQUIRED DATA
Implicit Data Structure
In computer science, an implicit data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a data structure that requires low overhead. They are called "implicit" because the position of the elements carries meaning and relationship between elements; this is contrasted with the use of pointers to give an explicit relationship between elements.
Passive data structure         
ANOTHER TERM FOR RECORD
Plain Old Data; Plain old data; Plain Old Data Structures; Plain old data structures; Plain old data structure
In computer science and object-oriented programming, a passive data structure (PDS, also termed a plain old data structure, or plain old data, POD) is a term for a record, to contrast with objects. It is a data structure that is represented only as passive collections of field values (instance variables), without using object-oriented features.

Wikipedia

Data structure

In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data.